On the 2-Colorability of Random Hypergraphs
نویسندگان
چکیده
A 2-coloring of a hypergraph is a mapping from its vertices to a set of two colors such that no edge is monochromatic. Let Hk(n,m) be a random k-uniform hypergraph on n vertices formed by picking m edges uniformly, independently and with replacement. It is easy to show that if r ≥ rc = 2k−1 ln 2− (ln 2)/2, then with high probability Hk(n,m = rn) is not 2-colorable. We complement this observation by proving that if r ≤ rc − 1 then with high probability Hk(n,m = rn) is 2-colorable.
منابع مشابه
How many random edges make a dense hypergraph non-2-colorable?
We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model for graphs has been started by Bohman et al. in [7], and continued in [8] and [16]. Here we obtain a tight bound on the number of random edges required to ensure non-2-colorability. We prove that for any k-uniform hypergr...
متن کاملA note on the colorability of mixed hypergraph using k colors
The colorability problem on mixed hypergraphs is discussed. A criterion of colorability of mixed hypergraph with k colors is given.
متن کاملGreedy colorings of uniform hypergraphs
We give a very short proof of an Erdős conjecture that the number of edges in a non-2-colorable n-uniform hypergraph is at least f(n)2, where f(n) goes to infinity. Originally it was solved by József Beck in 1977, showing that f(n) at least c log n. With an ingenious recoloring idea he later proved that f(n) ≥ cn. Here we prove a weaker bound on f(n), namely f(n) ≥ cn. Instead of recoloring a r...
متن کاملApproximate Hypergraph Coloring under Low-discrepancy and Related Promises
A hypergraph is said to be χ-colorable if its vertices can be colored with χ colors so that no hyperedge is monochromatic. 2-colorability is a fundamental property (called Property B) of hypergraphs and is extensively studied in combinatorics. Algorithmically, however, given a 2-colorable k-uniform hypergraph, it is NP-hard to find a 2-coloring miscoloring fewer than a fraction 2−k+1 of hypered...
متن کاملColoring Mixed Hypergraphs: from Combinatorics to Philosophy∗
We survey recent results and open problems on the chromatic spectrum, planarity and colorability of mixed hypergraphs and their relations to such categories of philosophy as identity and difference.
متن کامل